By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

ALERT ATTENTION: System maintenance will be performed the weekend of Saturday, March 28, 2009. This event will begin at 6:00 am on March 28 and will conclude at approximately 12:00 noon on Sunday March 29 (all times EDT). Some Scitation services may be affected during this period.
Table of Contents
Search This Issue
Volume 24, Issue 5, pp. 923-1139

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Computational Complexity of Two-Dimensional Regions

Arthur W. Chou and Ker-I Ko

pp. 923-947

BibTeX  Abstract Full Text:  PDF

Nearly Optimal Algorithms for Canonical Matrix Forms

Mark Giesbrecht

pp. 948-969

BibTeX  Abstract Full Text:  PDF

Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar $ST$-Digraphs

Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, and Ioannis G. Tollis

pp. 970-1001

BibTeX  Abstract Full Text:  PDF

Flow in Planar Graphs with Multiple Sources and Sinks

Gary L. Miller and Joseph (Seffi) Naor

pp. 1002-1017

BibTeX  Abstract Full Text:  PDF

A Subexponential Algorithm for Abstract Optimization Problems

Bernd Gärtner

pp. 1018-1035

BibTeX  Abstract Full Text:  PDF

Randomness-Optimal Unique Element Isolation with Applications to Perfect Matching and Related Problems

Suresh Chari, Pankaj Rohatgi, and Aravind Srinivasan

pp. 1036-1050

BibTeX  Abstract Full Text:  PDF

Minimum Cost Paths in Periodic Graphs

Franz Höfting and Egon Wanke

pp. 1051-1067

BibTeX  Abstract Full Text:  PDF

Polynomial-Time Membership Comparable Sets

Mitsunori Ogihara

pp. 1068-1081

BibTeX  Abstract Full Text:  PDF

With Quasilinear Queries EXP Is Not Polynomial Time Turing Reducible to Sparse Sets

Bin Fu

pp. 1082-1090

BibTeX  Abstract Full Text:  PDF

New Tight Bounds on Uniquely Represented Dictionaries

Arne Andersson and Thomas Ottmann

pp. 1091-1103

BibTeX  Abstract Full Text:  PDF

Scheduling Jobs with Temporal Distance Constraints

Ching-Chih Han, Kwei-Jay Lin, and Jane W.-S. Liu

pp. 1104-1121

BibTeX  Abstract Full Text:  PDF

On the Approximation of Shortest Common Supersequences and Longest Common Subsequences

Tao Jiang and Ming Li

pp. 1122-1139

BibTeX  Abstract Full Text:  PDF